Quicksort with Unreliable Comparisons: A Probabilistic Analysis
نویسندگان
چکیده
We provide a probabilistic analysis of the output of Quicksort when comparisons can err.
منابع مشابه
Sorting with Unreliable Comparisons: a Probabilistic Analysis
We provide a probabilistic analysis of the output of Quicksort when comparisons can err.
متن کاملProbabilistic Analysis of the Dual-Pivot Quicksort "Count"
Recently, Aumüller and Dietzfelbinger proposed a version of a dual-pivot quicksort, called “Count”, which is optimal among dual-pivot versions with respect to the average number of key comparisons required. In this note we provide further probabilistic analysis of “Count”. We derive an exact formula for the average number of swaps needed by “Count” as well as an asymptotic formula for the varia...
متن کاملThe Number of Bit Comparisons Used by Quicksort: an Average-case Analysis
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and so count the number of bit comparisons. On the other hand, the standard analyses of many other algorithms (such as Quicksort) are performed in terms of the number of key comparisons. We introduce the prospect of a fa...
متن کاملVerified Analysis of Random Trees
This work is a case study of the formal verification and complexity analysis of some famous probabilistic algorithms and data structures in the proof assistant Isabelle/HOL: the expected number of comparisons in randomised quicksort, the relationship between randomised quicksort and average-case deterministic quicksort, the expected shape of an unbalanced random Binary Search Tree, and the expe...
متن کاملThe limiting distribution for the number of symbol comparisons used by QuickSort is nondegenerate (extended abstract)
In a continuous-time setting, Fill (2012) proved, for a large class of probabilistic sources, that the number of symbol comparisons used by QuickSort, when centered by subtracting the mean and scaled by dividing by time, has a limiting distribution, but proved little about that limiting random variable Y —not even that it is nondegenerate. We establish the nondegeneracy of Y . The proof is perh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 13 شماره
صفحات -
تاریخ انتشار 2004